The Relationship Between Occam's Razor and Convergent Guessing

نویسنده

  • David H. Wolpert
چکیده

Occam's razor, the principle of parsimony, is a tool that finds application in many areas of science. Its validity has never been proven in full generality from first principles. Convergent guessing is the property th at as more examples of an input-output mapp ing are provided , one would expect the modelling of that mapping to become mor e and more accurate. It too is widely used and has not been proven from first principles. In thi s paper it is shown that Occam 's razor and convergent guessin g are not independ ent if convergent guessing holds , so does Occam 's raz or. (The converse of thi s statement is also true , providing some extra condi tions are met.) Therefore, if you have reason to believe th at your guesses are getting mor e accurate as you are fed more data, you also have reason to believe that application of Occam's razor will likely result in better guesses. Rather than attri butes concerning how an ar chitecture works (e .g. , it s coding length , or its number of free par ameters) , thi s pap er is concern ed exclusively with how the ar chitecture g uesses (which is, aft er all , what we're really interest ed in). In this contex t Occam's razor mean s that one should guess according to the "simplicity" of an archite cture's guessing behavior (as opposed to according to the sim plicity of how the ar chi tecture works). This pap er deduces an optimal measure of the "simplicity" of an architecture's guessing beh avior. Given this op timal simplicity measure, this paper th en establishes th e aforementioned relationship between Occam's razor and converg ent guessing. T his paper goes on to elucidate the many oth er advantages, both practical an d theoreti cal, of using the optimal simplicity measure. Finally, this paper end s by exploring the ramifications of th is analysis for the question of how best to measure t he "complexity" of a syste m. ' Elect ronic m ail ad dress: [email protected]. © 1990 Complex Systems Pu blications, Inc .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applying Occam's razor to paper (and rock and scissors, too): Why simpler models are sometimes better

A commonly held idea is that people engaged in guessing tasks try to detect sequential dependencies between the occurring events and behave accordingly. For instance, previous accounts of the popular Rock Paper Scissors game assume that people try to anticipate the move an opponent is likely to make and play a move capable of beating it. In the paper we propose that players modulate their behav...

متن کامل

Pixon-Based Image Restoration/Reconstruction

This lecture introduces pixon-based image restoration/reconstruction methods. The relationship between image Algorithmic Information Content and the Bayesian incarnation of Occam's Razor are discussed as well as the relationship of multiresolution pixon languages and image fractal dimension. Also discussed is the relationship of pixons to the role played by the Heisenberg uncertainty principle ...

متن کامل

Catastrophic Impact of Red Tides of Cochlodinium polykrikoides on the Razor Clam Solen dactylus in Coastal Waters of the Northern Persian Gulf

A Cochlodinium polykrikoides red tide occurred in northern coastal waters of the Persian Gulf which killed million tons of fish and benthic animals. This study reports high mortality rate of Solen dactylus (razor clam) populations on the Golshahr coast of Bandar Abbas to show that management and monitoring plans are necessary to prevent future mass mortalities. Specimens of S. dactylus were col...

متن کامل

Bayesian Model Comparison and Backprop Nets

The Bayesian model comparison framework is reviewed, and the Bayesian Occam's razor is explained. This framework can be applied to feedforward networks, making possible (1) objective comparisons between solutions using alternative network architectures; (2) objective choice of magnitude and type of weight decay terms; (3) quantified estimates of the error bars on network parameters and on netwo...

متن کامل

Extending Occam's Razor

Occam's Razor states that, all other things being equal, the simpler of two possible hypotheses is to be preferred. A quanti ed version of Occam's Razor has been proven for the PAC model of learning, giving sample-complexity bounds for learning using what Blumer et al. call an Occam algorithm [1]. We prove an analog of this result for Haussler's more general learning model, which encompasses le...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Complex Systems

دوره 4  شماره 

صفحات  -

تاریخ انتشار 1990